|
|
Routing Problems and Their Solutions
Pospíšil, Václav ; Dvořák, Jiří (referee) ; Šeda, Miloš (advisor)
The first part of the thesis is devoted to an Introduction and a comprehensive description of all important concepts of graph theory, which is followed by descriptions and modifications of two selected types of routing problems: the travelling salesman problem and the vehicle routing problem. The next part of the thesis deals with subsequent possibilities of solving problems through deterministic and stochastic algorithms. It also includes a practical part, which at the end of the thesis deals with the shortest path optimization of the two created models using Nearest neighbour algorithm, Genetic algorithm and solver in GAMS.
|
|
|
Routing Problems and Their Solutions
Pospíšil, Václav ; Dvořák, Jiří (referee) ; Šeda, Miloš (advisor)
The first part of the thesis is devoted to an Introduction and a comprehensive description of all important concepts of graph theory, which is followed by descriptions and modifications of two selected types of routing problems: the travelling salesman problem and the vehicle routing problem. The next part of the thesis deals with subsequent possibilities of solving problems through deterministic and stochastic algorithms. It also includes a practical part, which at the end of the thesis deals with the shortest path optimization of the two created models using Nearest neighbour algorithm, Genetic algorithm and solver in GAMS.
|
|
|
Planning cash delivery to exchange offices using Vehicle Routing Problem with Time Series
Mouchová, Denisa ; Skočdopolová, Veronika (advisor) ; Fábry, Jan (referee)
The purpose of this bachelor thesis is to apply vehicle routing problem with time series to a real case study. At first vehicle routing problem is classified into Operations Research and Travelling Salesman Problem. Then a simple vehicle routing problem and a multiple vehicle routing problem are described as well as their modifications with time series. Some heuristic algorithms and steps of nearest neighbour algorithm are described. The next part is focused on the application. It starts with introducing the company that is specialized in an exchange business and description of the situation that presents its assignments. There are three assignments in total. The first and second assignments are related to the optimization of cash delivery to company's branches. The second one also allows the company send a parcel with cash instead of its own delivery. The third assignment is to calculate whether a conversion cars into propellant gas is budget-wise or not. These assignments are solved and the results are commented.
|
|
|
Optimization of distribution of bakery goods
Gebauerová, Monika ; Fábry, Jan (advisor) ; Pelikán, Jan (referee)
This thesis deals with the optimization of distribution of bakery products. Firstly there are the fundamental types of vehicle routing problems and their optimization models introduced. Next part is dedicated to heuristic algorithms. The heuristic methods are introduced in general, then there are the chosen methods described. Later there are two chosen algorithms formulated. First one based on the nearest neighbour method and another one based on the savings algorithm. Both of algorithms were programmed in the Visual Basic of Applications MS Excel 2010. These algorithms were applied for the solution of the real problem dealing with the distribution of goods. The bakery company has provided the data about its customers for this purpose. The last part of this thesis is dedicated to the summary and comparison of the solution of the assigned problem that was gained by the proposed algorithms with the solution that the bakery company has put into practice.
|
|
|
Design and application of heuristics in distribution of ordered products to the consumers of NIKOL NÁPOJE a. s. company
Solnická, Veronika ; Fábry, Jan (advisor) ; Pelikán, Jan (referee)
This thesis deals with the optimization of distribution of products to consumers based on a real case study of a particular company from Opava. For this purpose, a mathematical optimization model is used to illustrate the vehicle routing problem. The study will also offer an explanation on the relevancy of heuristic methods, mainly with respect to their application in solving real life situations analogous to the one surveyed. On the basis of chosen heuristic methods (i.e. the nearest neighbour algorithm and the savings algorithm) and having taken into account the restricting conditions of the company, four algorithms were designed. These four algorithms are programmed in Visual Basic for Applications MS Excel 2007. They are aimed at solving the real problems with the distribution of ordered products that the particular company must deal with. The thesis compares the results provided by an employee of this company, and the results presented by the designed algorithms.
|
guest ::
